Reversible space–time simulation of cellular automata
نویسندگان
چکیده
منابع مشابه
Reversible space-time simulation of cellular automata
We brieey recall the deenitions of Cellular automata (ca), simulation, re-versibility and Partitioned cellular automata (pca) as deened by Morita. We call the sequence of the iterated conngurations of a connguration a space-time diagram. We deene an embedding relation between space-time diagrams and a space-time simulation relation between ca. We built a space-time simulation of any ca by a rev...
متن کاملRepresenting Reversible Cellular Automata with Reversible Block Cellular Automata
Cellular automata are mappings over infinite lattices such that each cell is updated according to the states around it and a unique local function. Block permutations are mappings that generalize a given permutation of blocks (finite arrays of fixed size) to a given partition of the lattice in blocks. We prove that any d-dimensional reversible cellular automaton can be expressed as the composit...
متن کاملReversible Simulation of One-Dimensional Irreversible Cellular Automata
A cellular automaton (CA) is called reversible (or injective) ii its global function is one-to-one. It has been shown by Toooli that any (irreversible) k-dimensional CA is simulated by a k + 1-dimensional RCA. In this paper, we show that any one-dimensional CA with nite conngurations can be simulated by a one-dimensional reversible CA. This is proved by using the framework of partitioned CA (PCA).
متن کاملReversible Cellular Automata
A reversible cellular automaton is one whose evolution, and therefore the entire past history of any con guration, can be uniquely deciphered. There are degrees of reversibility, depending upon whether the con gurations considered are arbitrary, periodic, or quiescent at in nity; which are subsidiary to more general questions of injectivity and surjectivity, within a general perspective of the ...
متن کاملReversible Cellular Automata Based Encryption
In this paper cellular automata (CA) are applied to construct a symmetric-key encryption algorithm. A new block cipher based on one dimensional, uniform and reversible CA is proposed. A class of CA with rules specifically constructed to be reversible is used. The algorithm uses 224 bit key. It is shown that the algorithm satisfies safety criterion called Strict Avalanche Criterion. Due to a hug...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2000
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(99)00075-4